Data-Driven Estimation of Capacity Upper Bounds

Capacity upper bounds for deletion-type channels

We develop a systematic approach, based on convex programming and real analysis, for obtaining upper bounds on the capacity of the binary deletion channel and, more generally, channels with i.i.d. insertions and deletions. Other than the classical deletion channel, we give a special attention to the Poisson-repeat channel introduced by Mitzenmacher and Drinea (IEEE Transactions on Information T...

Capacity Upper Bounds on Binary Deletion Channels

In this paper, we discuss the problem of bounding the capacity of binary deletion channels in light of the paper, “Tight Asymptotic Bounds for the Deletion Channel with Small Deletion Probabilities” (Kalai, Mitzenmacher, Sudan, 2010), which proves an upper bound of C ≤ 1 − (1 − o(1))H(p) for the capacity of a binary deletion channel for p approaching 0. We present a brief history surrounding th...

On Theoretical Upper Bounds for Routing Estimation

Routing space estimation plays a crucial role in design automation of digital systems. We investigate the problem of estimating upper bounds for global routing of two-terminal nets in two-dimensional arrays. We show the soundness of the bounds for both wiring space and total wire-length estimation.

Upper Bounds to the Capacity of Wireless Networks

Computation of upper-bounds for island-driven stochastic parsers

A theoretical framework has been introduced for the computation of syntactic upper-bounds for partial analyses obtained by an island-driven parser. Several proposals have been advanced in the ASR literature for the use of Alike algorithms, based on the computation of acoustical upper-bounds. Syntactic upper-bounds can be integrated with the acoustical ones to drive the search process toward bot...